An Optimal Parallel Algorithm for Constructing a Spanning Tree on Proper Circle Trapezoid Graphs
نویسندگان
چکیده
منابع مشابه
An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs
Let G = (V, E) be a graph with n vertices and m edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and (n 1) edges. For a weighted graph, the minimum spanning tree problem can be solved in O(log m) time with O(m) processors on the CRCW PRAM, and for an unweighed graph, the spanning tree problem can be solved in O(log n) time with O(n +m) proc...
متن کاملAn optimal minimum spanning tree algorithm
This thesis describes the optimal minimum spanning tree algorithm given by Pettie and Ramachandran (in Journal of the ACM, 2002). The algorithm presented finds a minimum spanning tree of a graph with n vertices and m edges deterministically in time O (T ∗ (m,n)), where T ∗ is the minimum number of edge-weight comparisons needed to determine the solution of the problem. The function T ∗ is the d...
متن کاملCircular and Circle Trapezoid Graphs
Along with the direction that generalizes interval graphs and permutation graphs to trapezoid graphs, researchers are now trying to generalize the class known as trapezoid graphs. A circle trapezoid is the region in a circle that lies between two non-crossing chords; thus, circle trapezoid graphs are the intersecting graphs of circle trapezoids within a circle. It should be noted that circle tr...
متن کاملA Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G = (V, E, ω). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbi...
متن کاملAn Optimal Parallel Circle-Cover Algorithm
Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with 0( n2) processors and use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Physics
سال: 2018
ISSN: 2327-4352,2327-4379
DOI: 10.4236/jamp.2018.68141